Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity

نویسندگان

  • Leonid Barenboim
  • Michael Elkin
  • Tzalik Maimon
چکیده

In the distributed message-passing setting a communication network is represented by a graph whose vertices represent processors that perform local computations and communicate over the edges of the graph. In the distributed edge-coloring problem the processors are required to assign colors to edges, such that all edges incident on the same vertex are assigned distinct colors. The previouslyknown deterministic algorithms for edge-coloring employed at least (2∆− 1) colors, even though any graph admits an edge-coloring with ∆ + 1 colors [36]. Moreover, the previously-known deterministic algorithms that employed at most O(∆) colors required superlogarithmic time [3, 6, 7, 17]. In the current paper we devise deterministic edge-coloring algorithms that employ only ∆ + o(∆) colors, for a very wide family of graphs. Specifically, as long as the arboricity a of the graph is a = O(∆1− ), for a constant > 0, our algorithm computes such a coloring within polylogarithmic deterministic time. We also devise significantly improved deterministic edge-coloring algorithms for general graphs for a very wide range of parameters. Specifically, for any value χ in the range [4∆, 2 ∆) · ∆], our χ-edge-coloring algorithm has smaller running time than the best previously-known χ-edge-coloring algorithms. Our algorithms are actually much more general, since edge-coloring is equivalent to vertexcoloring of line graphs. Our method is applicable to vertex-coloring of the family of graphs with bounded diversity that contains line graphs, line graphs of hypergraphs, and many other graphs. We significantly improve upon previous vertex-coloring of such graphs, and as an implication also obtain the improved edge-coloring algorithms for general graphs. Our results are obtained using a novel technique that connects vertices or edges in a certain way that reduces clique size. The resulting structures, which we call connectors, can be colored more efficiently than the original graph. Moreover, the color classes constitute simpler subgraphs that can be colored even more efficiently using appropriate connectors. Hence, we recurse until we obtain sufficiently simple structures that are colored directly. We introduce several types of connectors that are useful for various scenarios. We believe that this technique is of independent interest. ∗ Open University of Israel. E-mail: [email protected] ∗∗ Ben-Gurion University of the Negev. Email: [email protected] ∗∗∗ Open University of Israel. Email: [email protected] This research has been supported by the Israeli Academy of Science, grant 724/15. ar X iv :1 61 0. 06 75 9v 1 [ cs .D C ] 2 1 O ct 2 01 6

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

k-forested choosability of graphs with bounded maximum average degree

A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...

متن کامل

Edge-coloring Vertex-weightings of Graphs

Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...

متن کامل

A practical algorithm for [r, s, t]-coloring of graph

Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...

متن کامل

Planar graphs with $\Delta\geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable

For planar graphs, we consider the problems of list edge coloring and list total coloring. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors. Total coloring is the problem of coloring the edges and the vertices while ensuring that two edges that are adjacent, two vertices that are adjacent, or a vertex and an edge that ar...

متن کامل

An Optimal Distributed $(\Delta+1)$-Coloring Algorithm?

Vertex coloring is one of the classic symmetry breaking problems studied in distributed com-puting. In this paper we present a new algorithm for (∆ + 1)-list coloring in the randomizedLOCAL model running in O(log n + Detd(poly logn)) time, where Detd(n ′) is the determinis-tic complexity of (deg+1)-list coloring (v’s palette has size deg(v) + 1) onn′-vertex graphs.This impro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017